Computing connected components on parallel computers
نویسندگان
چکیده
منابع مشابه
Computing Strongly Connected Components in Parallel on
The problem of decomposition of a directed graph into its strongly connected components is a fundamental graph problem inherently present in many scientific and commercial applications. In this paper we show how existing parallel algorithms can be reformulated in order to be accelerated by NVIDIA CUDA technology. In particular, we design a new CUDA-aware procedure for pivot selection and we red...
متن کاملConnected components algorithms for mesh-connected parallel computers
We present a new CREW PRAM algorithm for nding connected components. For a graphG with n vertices andm edges, algorithmA0 requires at mostO(logn) parallel steps and performsO((n+m) logn) work in the worst case. The advantage our algorithm has over others in the literature is that it can be adapted to a 2-D mesh-connected communication model in which all CREW operations are replaced byO(logn) pa...
متن کاملOn Computing Connected Components of Line Segments
It is shown that given a set of n line segments their connected components can be computed in time O n log n A bound of o n for this problem would imply a similar bound for detecting for a given set of n points and n lines whether some point lies on some of the lines This problem known as Hopcroft s problem is believed to have a lower bound of n For the special case when the endpoints of each s...
متن کاملOn Identifying Strongly Connected Components in Parallel
The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm for this problem which has signi cantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we show the expected serial running time of our algorithm to be O(n log n).
متن کاملParallel Algorithms for Connected Components
In this paper, we describe our implementation of several parallel graph algorithms for nding connected components. Our implementation, with virtual processing, is on a 16,384-processor MasPar MP-1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22, 23], we reported the implementation of an extensible parallel graph algorithms library. We develop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1979
ISSN: 0001-0782,1557-7317
DOI: 10.1145/359138.359141